André–Quillen spectral sequence for THH

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Telescope Comparison Lemma for Thh

We extend to the non-connective case a lemma of Bökstedt about the equivalence of the telescope with a more complicated homotopy colimit of symmetric spectra used in the construction of THH.

متن کامل

A spectral sequence for splines

We de ne a complex R=J of graded modules on a d-dimensional simplicial complex , so that the top homology module of this complex consists of piecewise polynomial functions (splines) of smoothness r on the cone of . In a series of papers ([4], [5], [6]), Billera and Rose used a similar approach to study the dimension of the spaces of splines on , but with a complex substantially di erent fromR=J...

متن کامل

Spectral sequence compensation based on continuity of spectral sequence

Humans have an excellent ability to select a particular sound source from a noisy environment, called the \Cocktail-Party E ect" and to compensate for physically missing sound, called the \Illusion of Continuity." This paper proposes a spectral peak tracker as a model of the illusion of continuity (or phonemic restoration) and a spectral sequence prediction method using a spectral peak tracker....

متن کامل

A spectral sequence for string cohomology

Let X be a 1-connected space with free loop space ΛX. We introduce two spectral sequences converging towards H∗(ΛX;Z/p) and H((ΛX)hT;Z/p). The E2-terms are certain non Abelian derived functors applied to H∗(X;Z/p). When H∗(X;Z/p) is a polynomial algebra, the spectral sequences collapse for more or less trivial reasons. If X is a sphere it is a surprising fact that the spectral sequences collaps...

متن کامل

A spectral sequence for parallelized persistence

We approach the problem of the computation of persistent homology for large datasets by a divide-and-conquer strategy. Dividing the total space into separate but overlapping components, we are able to limit the total memory residency for any part of the computation, while not degrading the overall complexity much. Locally computed persistence information is then merged from the components and t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2003

ISSN: 0166-8641

DOI: 10.1016/s0166-8641(02)00184-0